0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.12/0.33 % Computer : n015.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1200 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Jul 13 15:56:49 EDT 2021 0.12/0.33 % CPUTime : 0.12/0.33 % Number of cores: 8 0.18/0.34 % Python version: Python 3.6.8 0.18/0.34 # Version: 2.6rc1-ho 0.18/0.34 # No SInE strategy applied 0.18/0.34 # Trying AutoSched0 for 59 seconds 0.18/0.37 # AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.18/0.37 # and selection function SelectComplexExceptUniqMaxHorn. 0.18/0.37 # 0.18/0.37 # Preprocessing time : 0.027 s 0.18/0.37 # Presaturation interreduction done 0.18/0.37 0.18/0.37 # Proof found! 0.18/0.37 # SZS status Theorem 0.18/0.37 # SZS output start CNFRefutation 0.18/0.37 thf(cTHM607_pme, conjecture, (?[X1:(a > $o) > a]:![X2:a > $o]:(X2 @ (X1 @ X2)<=?[X3:a]:X2 @ X3)=>(?[X4:b > a]:![X5:b, X6:b]:((X4 @ X5)=(X4 @ X6)=>(X5)=(X6))<=?[X7:a > b]:![X8:b]:?[X9:a]:(X7 @ X9)=(X8))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cTHM607_pme)). 0.18/0.37 thf(c_0_1, negated_conjecture, ~((?[X1:(a > $o) > a]:![X2:a > $o]:(?[X3:a]:X2 @ X3=>X2 @ (X1 @ X2))=>(?[X7:a > b]:![X8:b]:?[X9:a]:(X7 @ X9)=(X8)=>?[X4:b > a]:![X5:b, X6:b]:((X4 @ X5)=(X4 @ X6)=>(X5)=(X6))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM607_pme])])). 0.18/0.37 thf(c_0_2, negated_conjecture, ![X20:a > $o, X21:a, X23:b, X25:b > a]:((~X20 @ X21|X20 @ (esk1_0 @ X20))&((esk2_0 @ (esk3_1 @ X23))=(X23)&((X25 @ (esk4_1 @ X25))=(X25 @ (esk5_1 @ X25))&(esk4_1 @ X25)!=(esk5_1 @ X25)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])). 0.18/0.37 thf(c_0_3, negated_conjecture, ![X5:b]:(esk2_0 @ (esk3_1 @ X5))=(X5), inference(split_conjunct,[status(thm)],[c_0_2])). 0.18/0.37 thf(c_0_4, negated_conjecture, ![X4:b > a]:(X4 @ (esk4_1 @ X4))=(X4 @ (esk5_1 @ X4)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.18/0.37 thf(c_0_5, negated_conjecture, ![X4:b > a]:(esk4_1 @ X4)!=(esk5_1 @ X4), inference(split_conjunct,[status(thm)],[c_0_2])). 0.18/0.37 thf(c_0_6, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3, c_0_4]), c_0_3]), c_0_5]), ['proof']). 0.18/0.37 # SZS output end CNFRefutation 0.18/0.37 # Proof object total steps : 7 0.18/0.37 # Proof object clause steps : 4 0.18/0.37 # Proof object formula steps : 3 0.18/0.37 # Proof object conjectures : 7 0.18/0.37 # Proof object clause conjectures : 4 0.18/0.37 # Proof object formula conjectures : 3 0.18/0.37 # Proof object initial clauses used : 3 0.18/0.37 # Proof object initial formulas used : 1 0.18/0.37 # Proof object generating inferences : 1 0.18/0.37 # Proof object simplifying inferences : 2 0.18/0.37 # Training examples: 0 positive, 0 negative 0.18/0.37 # Parsed axioms : 3 0.18/0.37 # Removed by relevancy pruning/SinE : 0 0.18/0.37 # Initial clauses : 6 0.18/0.37 # Removed in clause preprocessing : 2 0.18/0.37 # Initial clauses in saturation : 4 0.18/0.37 # Processed clauses : 7 0.18/0.37 # ...of these trivial : 0 0.18/0.37 # ...subsumed : 0 0.18/0.37 # ...remaining for further processing : 7 0.18/0.37 # Other redundant clauses eliminated : 0 0.18/0.37 # Clauses deleted for lack of memory : 0 0.18/0.37 # Backward-subsumed : 0 0.18/0.37 # Backward-rewritten : 0 0.18/0.37 # Generated clauses : 1 0.18/0.37 # ...of the previous two non-trivial : 0 0.18/0.37 # Contextual simplify-reflections : 0 0.18/0.37 # Paramodulations : 1 0.18/0.37 # Factorizations : 0 0.18/0.37 # NegExts : 0 0.18/0.37 # Equation resolutions : 0 0.18/0.37 # Propositional unsat checks : 0 0.18/0.37 # Propositional check models : 0 0.18/0.37 # Propositional check unsatisfiable : 0 0.18/0.37 # Propositional clauses : 0 0.18/0.37 # Propositional clauses after purity: 0 0.18/0.37 # Propositional unsat core size : 0 0.18/0.37 # Propositional preprocessing time : 0.000 0.18/0.37 # Propositional encoding time : 0.000 0.18/0.37 # Propositional solver time : 0.000 0.18/0.37 # Success case prop preproc time : 0.000 0.18/0.37 # Success case prop encoding time : 0.000 0.18/0.37 # Success case prop solver time : 0.000 0.18/0.37 # Current number of processed clauses : 3 0.18/0.37 # Positive orientable unit clauses : 2 0.18/0.37 # Positive unorientable unit clauses: 0 0.18/0.37 # Negative unit clauses : 1 0.18/0.37 # Non-unit-clauses : 0 0.18/0.37 # Current number of unprocessed clauses: 1 0.18/0.37 # ...number of literals in the above : 2 0.18/0.37 # Current number of archived formulas : 0 0.18/0.37 # Current number of archived clauses : 4 0.18/0.37 # Clause-clause subsumption calls (NU) : 0 0.18/0.37 # Rec. Clause-clause subsumption calls : 0 0.18/0.37 # Non-unit clause-clause subsumptions : 0 0.18/0.37 # Unit Clause-clause subsumption calls : 0 0.18/0.37 # Rewrite failures with RHS unbound : 0 0.18/0.37 # BW rewrite match attempts : 0 0.18/0.37 # BW rewrite match successes : 0 0.18/0.37 # Condensation attempts : 0 0.18/0.37 # Condensation successes : 0 0.18/0.37 # Termbank termtop insertions : 398 0.18/0.37 0.18/0.37 # ------------------------------------------------- 0.18/0.37 # User time : 0.025 s 0.18/0.37 # System time : 0.005 s 0.18/0.37 # Total time : 0.030 s 0.18/0.37 # Maximum resident set size: 1652 pages 0.18/0.37 EOF